The decomposition of a generalized graph into isomorphic subgraphs
نویسندگان
چکیده
منابع مشابه
Isomorphic Subgraphs in a Graph
At the combinatorics meeting of this Proceedings J . Schönheim posed the following problem : Is it true, that every graph of n edges has two (not necessarily induced isomorphic edge disjoint subgraphs with say f edges? In the present note we answer this question in the affirmative . In fact we prove that every graph of n edges contains two isomorphic edge disjoint subgraphs with cn 2/3 edges an...
متن کاملMaximal Chains of Isomorphic Subgraphs of the Rado Graph
The partial order 〈E(R) ∪ {∅},⊂〉, where E(R) is the set of isomorphic subgraphs of the Rado graph R, is investigated. The order types of maximal chains in this poset are characterized as the order types of compact sets of reals having the minimum non-isolated. 2000 Mathematics Subject Classification: 05C80, 06A05, 06A06.
متن کاملDecomposing the vertex set of a hypercube into isomorphic subgraphs
Let G be an induced subgraph of the hypercube Qk for some k. We show that if |G| is a power of 2 then, for sufficiciently large n, the vertex set of Qn can be partitioned into induced copies of G. This answers a question of Offner. In fact, we prove a stronger statement: if X is a subset of {0, 1} for some k and if |X | is a power of 2, then, for sufficiently large n, {0, 1} can be partitioned ...
متن کاملMinimal Decomposition of All Graphs with Equinumerous Vertices and Edges into Mutually Isomorphic Subgraphs
Suppose G = {GI, G21 . . . , G k } is a collection of graphs*, all having the same number of edges . By a U-decomposition of G we mean a set of r partitions of the edge set E(G j ) of the Gt , say E(G,) _ Z Eti , such that i=1 for each j, all the Eii (1 < i < k), are isomorphic as graphs . Define the function U(G) to be the least possible value of r any U-decomposition of G can have. Finally, l...
متن کاملPartitioning a graph into two isomorphic pieces
A simple graph G has the neighbour-closed-co-neighbour property, or ncc property, if for all vertices x of G, the subgraph induced by the set of neighbours of x is isomorphic to the subgraph induced by the set of non-neighbours of x. We present characterizations of graphs with the ncc property via the existence of certain perfect matchings, and thereby prove that the ncc graphs can be recognize...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1968
ISSN: 0528-2195
DOI: 10.21136/cpm.1968.117624